Concurrency Theory of Cyclic and Acyclic Processes
نویسنده
چکیده
This work investigates the axiomatic concurrency theory proposed by Carl Adam Petri as a basis of general net theory starting with physically motivated axioms. A formulation in terms of partially ordered sets is intensionally not adopted here, in order to deal with this theory in a more general setting, viewing causality and concurrency as pure similarity relations. Concurrency structures, which are the models of this theory, are intended to describe the synchronisation structure of possibly cyclic processes at an arbitrary level of abstraction. The major result of this work is that under certain conditions we can associate exactly two nets (of which one is the inverse of the other) with every concurrency structure. An appropriate elementary-net-speci cation based upon one of these nets has a case class that coincides with the class of statelike cuts. In other words, under appropriate assumptions supplementing Petri's axioms the token game is sound and complete to evolve the dynamics of concurrency structures. Kurzfassung Diese Arbeit untersucht, die von Carl Adam Petri vorgeschlagene, axiomatische Concurrency-Theorie als Basis der allgemeinen Netztheorie, ausgehend von physikalisch motivierten Axiomen. Eine Formulierung mit Hilfe von partiellen Ordnungen wird absichtlich vermieden, um die Theorie auf einer allgemeineren Grundlage zu studieren, die Nebenl au gkeit und Kausalit at als reine Ahnlichkeitsrelationen au a t. Die Concurrency-Strukturen, die sich als Modelle dieser Theorie ergeben, sollen die Synchronisationsstruktur von m oglicherweise zyklischen Prozessen auf einer beliebigen Abstraktionsebene beschreiben. Das Hauptresultat dieser Arbeit ist, da wir unter bestimmten Bedingungen genau zwei Netze (ein Netz und sein Inverses) mit jeder Concurrency-Struktur assoziieren k onnen. Ein geeignetes elementares Netzsystem, das auf einem dieser Netze basiert, hat ferner eine Fallklasse, die mit der Klasse der zustandsartigen Schnitte identisch ist. Mit anderen Worten: Das ubliche Markenspiel ist unter geeigneten, Petris Axiome erg anzenden Annahmen, korrekt und vollst andig, um die Dynamik von Concurrency-Strukturen zu entwickeln. 3
منابع مشابه
The Inductive Inference of Cyclic Synchronized Interleaving
An inductive inference algorithm for inferring cyclic interleaving expressions from homing sequences is presented. The restricted language studied uses a synchronized interleaving or shuue operator, which is an important component in algebraic theories of concurrency. Expressions of this language denote concurrent perpetual processes that communicate via synchronized handshaking. The paper intr...
متن کاملOn Negotiation as Concurrency Primitive II: Deterministic Cyclic Negotiations
We continue our study of negotations, a concurrency model with multiparty negotiation as primitive. In a previous paper [7] we have provided a correct and complete set of reduction rules for sound, acyclic, and (weakly) deterministic negotiations. In this paper we extend this result to all deterministic negotiations, including cyclic ones. We also show that this set of rules allows one to decid...
متن کاملA Graph Abstract Machine Describing Event Structure Composition
Event structures, Game Semantics strategies and Linear Logic proof-nets arise in different domains (concurrency, semantics, proof-theory) but can all be described by means of directed acyclic graphs (dag’s). They are all equipped with a specific notion of composition, interaction or normalization. We report on-going work, aiming to investigate the common dynamics which seems to underly these di...
متن کاملTransition And Cancellation In Concurrency And Branching Time
We review the conceptual development of (true) concurrency and branching time starting from Petri nets and proceeding via Mazurkiewicz traces, pomsets, bisimulation, and event structures up to higher dimensional automata (HDAs), whose acyclic case may be identified with triadic event structures and triadic Chu spaces. Acyclic HDAs may be understood as the extension of Boolean logic with a third...
متن کاملAlgebraic Structures of Directed Acyclic Graphs: Application to Concurrent Calculus
The paper deenes an algebraic tool for manipulating directed acyclic graphs (on short dags). The approach we propose combines two mathematical tools { category theory and universal algebra { and it allows an unitary treating of dags transformations. We show that the speciication, implementation and programming of concurrent systems can be achieved by using this theory.
متن کامل